Grokking LinkedIn Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
LinkedIn Easy
Find Pivot Index (easy)
Solution: Find Pivot Index
Isomorphic Strings (easy)
Solution: Isomorphic Strings
Second Minimum Node In a Binary Tree (easy)
Solution: Second Minimum Node In a Binary Tree
Minimum Time to Type Word Using Special Typewriter (easy)
Solution: Minimum Time to Type Word Using Special Typewriter
Intersection of Two Arrays (easy)
Solution: Intersection of Two Arrays
Can Place Flowers (easy)
Solution: Can Place Flowers
Valid Perfect Square (easy)
Solution: Valid Perfect Square
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Sqrt (easy)
Solution: Sqrt
Valid Palindrome (easy)
Solution: Valid Palindrome
LinkedIn Medium
Rotate List (medium)
Solution: Rotate List
Find Leaves of Binary Tree (medium)
Solution: Find Leaves of Binary Tree
Valid Triangle Number (medium)
Solution: Valid Triangle Number
Valid Parenthesis String (medium)
Solution: Valid Parenthesis String
Edit Distance (medium)
Solution: Edit Distance
Remove All Ones With Row and Column Flips II (medium)
Solution: Remove All Ones With Row and Column Flips II
Reverse Integer (medium)
Solution: Reverse Integer
Triplet Sum to Zero (medium)
Solution: Triplet Sum to Zero
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Decode Ways (medium)
Solution: Decode Ways
Quadruple Sum to Target (medium)
Solution: Quadruple Sum to Target
Next Permutation (medium)
Solution: Next Permutation
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Word Search (medium)
Solution: Word Search
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
House Robber II (medium)
Solution: House Robber II
Coin Change
Solution: Coin Change
Design Add and Search Words Data Structure (medium)
Solution: Design Add and Search Words Data Structure
Merge Intervals (medium)
Solution: Merge Intervals
Number of Islands (easy)
Solution: Number of Islands
Longest Palindromic Subsequence (medium)
Solution: Longest Palindromic Subsequence
Kth Smallest Number (medium)
Solution: Kth Smallest Number
Maximum Product Subarray (medium)
Solution: Maximum Product Subarray
Same Tree (medium)
Solution: Same Tree
LinkedIn Hard
Max Points on a Line (hard)
Solution: Max Points on a Line
Closest Binary Search Tree Value II (hard)
Solution: Closest Binary Search Tree Value II
Word Ladder (hard)
Solution: Word Ladder
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Largest Rectangle in Histogram (hard)
Solution: Largest Rectangle in Histogram
Serialize and Deserialize Binary Tree (hard)
Solution: Serialize and Deserialize Binary Tree
Solution: Largest Rectangle in Histogram

Problem Statement

Given an array of integers heights, where heights[i] represents the height of the histogram's bar, return the area of the largest rectangle in the histogram. Each bar has width equal to 1.

Examples

  • Example 1:
    • Input: [4, 2, 3, 2]
Image
  • Expected Output: 8

  • Justification: The largest rectangle can be drawn from the first bar to the fourth bar, having height 2, resulting in an area of 2x4=8.

  • Example 2:

    • Input: [1,3,4,5,2]
Image
  • Expected Output: 9

  • Justification: The largest rectangle can be drawn from the second bar to the fourth bar, having height 3, resulting in an area of 3x3=9.

  • Example 3:

    • Input: [6,2,5,4,5,1,6]
Image
  • Expected Output: 12
  • Justification: The maximum rectangular area is formed by the bars of heights 5, 4, 5, which is equal to 4x3=12. This rectangle spans from the third to the sixth bar.

Solution

To solve this problem, the key approach is to utilize a stack to keep track of bars that are potentially part of the largest rectangle. We traverse each bar in the histogram and use the stack to maintain bars in ascending order of height. When we encounter a bar that is shorter than the bar at the top of the stack, it indicates the end of a potentially largest rectangle involving the top-of-stack bar. By calculating the area of the rectangle with the stack's top bar as the smallest bar and comparing it with the maximum area found so far, we ensure that we find the largest rectangle.

This method is effective because it allows us to dynamically adjust to the changing potential for the largest rectangle as we iterate through the bars. It combines the efficiency of a single pass through the data with the ability to backtrack and calculate areas as soon as we know a rectangle's bounds. This blend of forward-looking and immediate calculation ensures we efficiently find the largest possible rectangle.

Step-by-step Algorithm

  • Initialize an empty stack to keep track of the indices of bars.
  • Iterate through each bar in the histogram.
    • While the stack is not empty and the current bar's height is less than the height of the bar at the top of the stack:
      • Pop the top of the stack. Let this be topIndex.
      • Calculate the area of the rectangle using the height of the popped bar. If the stack is empty, the width is the current index i; otherwise, it's i - stack.peek() - 1.
      • Update the maximum area if necessary.
    • Push the current index onto the stack.
  • Return the maximum area found.

Algorithm Walkthrough

Let's consider the input [6,2,5,4,5,1,6]:

  • Step 1: Start with an empty stack and maxArea = 0.
  • Step 2: Iterate through each bar's height:
    • At index 0 (height=6):
      • Push 0 onto the stack.
      • maxArea remains 0.
    • At index 1 (height=2):
      • Since 6 > 2, pop index 0 from the stack. Calculate area: 6 * (1 - 0) = 6. Update maxArea to 6.
      • Push index 1 onto the stack.
    • At index 2 (height=5):
      • Push index 2 onto the stack since 2 < 5. maxArea remains 6.
    • At index 3 (height=4):
      • Since 5 > 4, pop index 2 from the stack. Calculate area: 5 * (3 - 1 - 1) = 5. maxArea remains same.
      • Push index 3 onto the stack.
    • At index 4 (height=5):
      • Push index 4 onto the stack since 4 < 5. maxArea remains 6.
    • At index 5 (height=1):
      • Since 5 > 1, pop index 4 from the stack. Calculate area: 5 * (5 - 3 - 1) = 5. maxArea remains 6.
      • Since 4 > 1, pop index 3 from the stack. Calculate area: 4 * (5 - 1 - 1) = 12. Update maxArea to 12.
      • Since 2 > 1, pop index 1 from the stack. Calculate area: 2 * (i) = 2 * (5) = 10. maxArea remains same 12.
      • Push index 5 onto the stack.
    • At index 6 (height=6):
      • Since 1 < 6, push index 6 onto the stack. maxArea remains 12.
  • Final maxArea is 12.

Code

Java
Saved to Cloud

. . . .

Complexity Analysis

Time Complexity

  • : The algorithm traverses the histogram (array of bar heights) exactly twice in the worst case. The first traversal is the main loop where each bar is examined once. The second traversal occurs implicitly through stack operations. This leads to the linear time complexity.

Space Complexity

  • : The space complexity is determined by the stack that is used to store indices of bars. In the worst-case scenario, all bars are pushed onto the stack, requiring a space proportional to the number of bars.
Largest Rectangle in Histogram (hard)
Serialize and Deserialize Binary Tree (hard)
Mark as Completed

On this page

Problem Statement

Examples

Solution

Step-by-step Algorithm

Algorithm Walkthrough

Code

Complexity Analysis

Time Complexity

Space Complexity